x

boolean algebra

uploads/boolean algebra.jpg

boolean algebra Boolean algebra,布爾代數，邏輯代數。

Boolean algebra,布爾代數，邏輯代數。 “algebra“ 中文翻譯：   n. 代數學。 “boolesche algebra boolean algebra“ 中文翻譯：   布爾代數“ba boolean algebra“ 中文翻譯：   布爾代數“binary boolean algebra“ 中文翻譯：   二進制布爾代數“boolean algebra (ba)“ 中文翻譯：   布爾代數“boolean algebra of propositional logic“ 中文翻譯：   命題邏輯布爾代數“canonical form (boolean algebra)“ 中文翻譯：   規范形式 (布爾代數)“complete boolean algebra“ 中文翻譯：   完全布爾代數“degenerate boolean algebra“ 中文翻譯：   退化的布林代數“free boolean algebra“ 中文翻譯：   自由布爾代數“generalized boolean algebra“ 中文翻譯：   廣義布爾代數“list of boolean algebra topics“ 中文翻譯：   布爾代數主題列表“monadic boolean algebra“ 中文翻譯：   一元布爾代數“nondegenerate boolean algebra“ 中文翻譯：   非退化布爾代數“residuated boolean algebra“ 中文翻譯：   剩余布爾代數“two element boolean algebra“ 中文翻譯：   二元布爾代數“two-element boolean algebra“ 中文翻譯：   兩元素布爾代數“weakly distributive boolean algebra“ 中文翻譯：   弱分配布爾代數“boolean algebra,布爾代數，邏輯代數。“ 中文翻譯：   boolean algebra“boolean“ 中文翻譯：   布爾的, 邏輯的, 布爾型; 布爾符號; 布爾命令; 布爾運算; 布爾值; 布林值; 判斷; 選輯的“boolean not“ 中文翻譯：   邏輯求反“boolean or“ 中文翻譯：   邏輯加“algebra algebra“ 中文翻譯：   代數(學)“aeussere algebra exterior algebra“ 中文翻譯：   外代數“boolean addition“ 中文翻譯：   布爾矩陣加法“boolean add“ 中文翻譯：   布爾加; 邏輯加

First some methods are introduced about the relative reductions in decision information system and in uncompleted system . for example , by the method of the binary string and the “ and “ of logic operation , we may get reductions which need not create the discern matrix and avoid using the absorption law of boolean algebra ; by defining some new functions , we may also get reductions . the parts of the methods are programmed by matlab 論文首先介紹了常見的約簡和相對約簡的方法，在此基礎之上，提出及修改了一些相關定義，給出有關算法，并通過修改傳統的差別函數為相似關系，及運用自定義的函數，不經復雜的邏輯化簡，而是利用吸收律，在不生成分辨矩陣的情況下求出不完備信息系統約簡集；通過分析差別函數的實質，修改了差別函數的定義，直接轉換為用二進制表示的二進制位串的方法，通過“位與”操作，求解約簡集等，并通過matlab證明了該方法的可行性。

boom

According to the principle of generation of prime number through boolean algebra logic operation and phase angle matrix analysis of the periodic function it comes out that any even number larger than 4 can be expressed as the sum of two prime numbers ， i . e . “ 1 + 1 ” is tenable , and thereby finishes demonstration of the validity of goldbach ' s conjecture 根據素數的形成機理，從布爾代數的邏輯運算和周期函數的相角矩陣分析，都得出了大于4的任何偶數都可表示成兩個素數之和即“ 1 + 1 ”成立，從而完成了哥德巴赫猜想成立的論證。

First some methods are introduced about the relative reductions in decision information system and in uncompleted system . for example , by the method of the binary string and the “ and “ of logic operation , we may get reductions which need not create the discern matrix and avoid using the absorption law of boolean algebra ; by defining some new functions , we may also get reductions . the parts of the methods are programmed by matlab 論文首先介紹了常見的約簡和相對約簡的方法，在此基礎之上，提出及修改了一些相關定義，給出有關算法，并通過修改傳統的差別函數為相似關系，及運用自定義的函數，不經復雜的邏輯化簡，而是利用吸收律，在不生成分辨矩陣的情況下求出不完備信息系統約簡集；通過分析差別函數的實質，修改了差別函數的定義，直接轉換為用二進制表示的二進制位串的方法，通過“位與”操作，求解約簡集等，并通過matlab證明了該方法的可行性。

It combines boolean algebra expression with time information to describe behavior of a digital circuit . it has made substantive progress at path sensitization , power dissipation estimation , iddt and delay fault diagnosis . theoretically , it is necessary to establish some mathematical foundation in order to define distance , limit and continuity based on boolean process 它將布爾代數與時間結合起來，為異步性描述提供了比較形式的理論基礎，并在通路敏化、電源消耗的計算、動態電流測試方法( i _ ( ddt ) ) 、時延故障診斷等方面取得了實質性的進展。

In the third part , this paper studies the mp filters of mtl algebras from many respects . it gives the definition of maximal mp filters , provides the equivalent condition of maximal mp filters , depicts the structure of the subalgebras of mtl algebras , discusses locally finite mtl algebras ; studies the boolean filters of mtl algebras , proves if f is a boolean filters of m which is an mtl algebra , then m / - f is a boolean algebra and discusses local mtl algebras 第三章：從多方面研究了mtl代數的mp濾子，給出mtl代數極大mp濾子的定義；找出了是mtl代數極大mp濾子的等價條件；對mtl代數的子代數給予刻劃；還討論了局部有限mtl代數；研究了mtl代數的布爾濾子；證明了當f是mtl代數m的布爾濾子時， m f是布爾代數；還討論了局部mtl代數。

In this paper , a new type algebra is introduced , it is the algebraic abstract of mpm system just as boolean algebra is the algebraic abstract of 2 - valued propositional calculus . the main purpose of this paper is to investigate the various properties of the new algebra . in addition , this paper constructs an axiom set based on the medium logic propositional calculus system mpm , and gives a proof of its completeness 本文通過對mpm中介邏輯命題演算系統進行代數抽象,建立了一個新的代數系統,討論了該代數系統的性質,并利用該代數系統的代數性質構造了中介命題演算系統mpm上的一個公理完備集合,使用該公理集合可以方便的推導出mpm上的等值和互推公式,這對于處理不完全信息數據庫的查詢優化有著重要作用。

The introduction states that the audience is the high - school student , but this reference also provides an excellent background for college students and adult library patrons researching topics such as germ theory , boolean algebra , or the invention of the typewriter 引進國觀眾是高校學生，但這一提法，也提供了一個很好的背景，為大學生和成人圖書館食客研究的課題，如胚芽理論，布爾代數，或發明的打字機。

An operation performed in boolean algebra on two binary digits simultaneously in a way that the result is one if either one or both digits are a one , or zero if both digits are zero . the logic operator is the or operator 布爾代數中的一種運算，它同時對兩個二進制數字進行如下操作：如果一個數或二個數為1 ，則結果為1 ；如果二個數均為零，則結果為零。它的邏輯算符是or運算符。

The relations between heyting algebra and implication algebra with some conditions on a partial ordered set are discussed . then some conditions when a implication algebra is a boolean algebra are given . 3 系統地研究了偏序集上蘊涵代數與heyting代數之間的關系，得到了蘊涵代數中蘊涵算子的一個較好的條件，并給出了偏序集上蘊涵代數成為布爾代數的一些條件。

In this thesis , we first compile some utilizable parts of boolean algebra theory , which are the fundamental objects : the structure of boolean algebra , the boolean functions , the boolean equations , and the boolean matrices 本文編寫整理了布爾代數理論中較為實用的部分，主要包括布爾代數結構、布爾函數、布爾方程、布爾矩陣等方面的基礎內容。

This program creates truth tables from boolean expressions . i believe that it ' s very useful for computer science students who learning boolean algebra and predicate logic ( like my self ) 這個程序從布爾表達式中創建真實的表格。我相信對于學習布爾代數學和謂詞邏輯的計算機科學學生（像我自己這樣的）來說它是非常有用的。

An operation performed in boolean algebra on two binary digits simultaneously in a way that the result is one if either one or both digits are a one , or zero if both digits are zero 布爾代數中的一種運算，它同時對兩個二進制數字進行如下操作：如果一個數或二個數為1 ，則結果為1 ；如果二個數均為零，則結果為零。

In this paper , we shall characterize the linear operators that strongly preserve nilpotent matrices and that strongly preserve invertible matrices over boolean algebras and antinegative semirings without zero divisors 本文將刻畫在布爾代數和非負無零因子半環上強保持冪零矩陣和可逆矩陣的線性算子

By the means of the extension of linear operator , we characterize the linear operators that strongly preserve nilpotence and that strongly preserve invertibility over any boolean algebra 再利用線性擴張這一工具,我們刻畫了在一般布爾代數上強保持冪零的線性算子和強保持可逆的線性算子

With high speed and large - scale integration of electronic circuits , boolean algebra is insufficient to describe the complicated logic behavior of digital circuits 近些年來，隨著電子電路的高速化和大規模集成化，布爾代數作為描述數字電路的邏輯行為的工具，越來越顯示其不足

In order to characterize the linear operators that strongly preserve nilpotence and that strongly preserve invertibility , we first study the case of the binary boolean algebra 為了刻畫強保持冪零的線性算子和強保持可逆的線性算子，我們首先研究二元布爾代數上的情況

Then , we study the case of finite boolean algebra based on the fact that any finite boolean algebra is the direct product of a finite number of binary boolean algebra 然后，基于有限布爾代數是二元布爾代數的有限直積這一事實，討論了有限布爾代數上的情況

George boole develops a system of mathematics called boolean algebra , which uses binary operations . today , programmers still think and work in binary 喬治.布爾開發采用二進位制運算的數學體系，稱為布爾代數學。今天，程序員們仍使用二進位制進行思索和工作。

The boolean algebra of checking various attributes like these is demonstrated by my test for only successfully delivered pages with known referrers 對于只針對成功傳送、且引用者已知的頁面，我的測試演示了類似這樣的檢查各種屬性的布爾代數。